Fast Detection and Display of Symmetry in Trees
نویسندگان
چکیده
The automatic construction of good drawings of abstract graphs is a problem of practical importance. Displaying symmetry appears as one of the main criteria for achieving goodness. An expression is obtained for the maximum number of axial symmetries of a tree which can be simultaneously displayed in a single drawing, and an algorithm is presented for constructing such a maximally-symmetric drawing. Similar results are also obtained for rotational symmetries in trees. The algorithms run in time which is linear in the size of the tree, and hence are optimal.
منابع مشابه
Evaluation of the morphological Characteristics of broadleaf and needle leaf old trees for Use in Reforestation of forests in Ilam Province
Old trees as the most important genetic reserves of the country have great importance and value in various aspects of ecology, forest restoration management, ecotourism and even history. In this research, after identification of the old trees in the forests of Ilam province, their morphological characteristics including DBH, trunk height, total height, crown length, min & max crown diameter, cr...
متن کاملبررسی ویژگی های ریخت شناسی درختان کهنسال در جنگل های زاگرس (مطالعه موردی: جنگل های استان ایلام)
This study was conducted in oak forests of Ilam province in order to evaluate the morphological characteristics of old trees including diameter at breast height, trunk height, whole tree height, minimum and maximum crown diameter, crown health, crown vitality, crown symmetry, health and form of the trunk, Was investigated. Selection of old trees was performed based on the criteria of DBH and wi...
متن کاملUltra-Fast All-Optical Symmetry 4×2 Encoder Based on Interface Effect in 2D Photonic Crystal
This paper deals with the design and simulation of all-optical 4×2 encoderusing the wave interference effect in photonic crystals. By producing 4 opticalwaveguides as input and two waveguides as output, the given structure was designed.The size of the designed structure is 133.9 μm2. The given all-optical encoder has acontrast ratio of 13.2 dB, the response time of 0.45 ...
متن کاملOn the extremal total irregularity index of n-vertex trees with fixed maximum degree
In the extension of irregularity indices, Abdo et. al. [1] defined the total irregu-larity of a graph G = (V, E) as irrt(G) = 21 Pu,v∈V (G) du − dv, where du denotesthe vertex degree of a vertex u ∈ V (G). In this paper, we investigate the totalirregularity of trees with bounded maximal degree Δ and state integer linear pro-gramming problem which gives standard information about extremal trees a...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013